Implementation of Algorithms to Classify Musical Texts According to Rhythms

An interesting problem in musicology is to classify songs according to rhythms. A rhythm is represented by a sequence of “Quick” (Q) and “Slow” (S) symbols, which correspond to the (relative) duration of notes, such that S = 2Q. Recently, Christodoulakis et al. [3] presented an efficient algorithm that can be used to classify musical texts according to rhythms. In this paper, we implement the above algorithm along with the naive brute force algorithm to solve the same problem. We then analyze the theoretical time complexity bounds with the actual running times achieved by the experiments and compare the results of the two algorithms. Keywords— algorithms, music information retrieval, pattern matching, quick-slow, rhythm.